unconstrained minimization meaning in Chinese

无约束极小化

Examples

It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function
我们知道，通过广义d -间隙函数，可以将变分不等式问题转化为一个无约束极小化问题。
We constitute the corresponding derivative - free descent algorithm . after we proved the well - definition and global convergence of our derivative - free descent algorithm , we compare our algorithm with some existent derivative - free descent algorithms based on unconstrained minimization formulation
在证明了所构造的derivative - free算法的合理性以及整体收敛性之后，我们将所构造的算法与以前已经存在的无约束型的derivative - free算法进行了比较。
Chapter 4 studies the techniques for numerical realization of the dual algorithms and generalization of the dual algorithms to general unconstrained nonlinear programming . at first , we construct modified dual algorithms to overcome the drawback that it needs to resolve a sequential unconstrained minimization problems exactly in the step 2 of the dual algorithms in chapter 2 and chapter 3
首先针对前两章的对偶算法由于需要精确求解一系列无约束极小化问题，因而实际计算中很难实现这一缺点，构造修正的对偶算法，即，关于势函数的无约束极小化问题无需精确求解的对偶算法。
By intro - ducing a penalty function as the following , for every e > 0 , we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem . the solutions of such a sequence of unconstrained minimization problems all exist , and they converge to the solution of the constrained minimization problem in a certain sense
这列无约束极小化问题( p _ )的解都是存在的，并且在某种意义下收敛至原始约束极小化问题( p )的解，不仅如此，它们的性能指标也收敛至原始问题( p )解的性能指标。

unconstrained minimization meaning in Chinese

Examples

Related Words